Derandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets
نویسنده
چکیده
Derandomization of Chernoff bound with union bound is already proven in many papers. We here give another explicit version of it that obtains a construction of size that is arbitrary close to the probabilistic nonconstructive size. We apply this to give a new simple polynomial time constructions of almost k-wise independent sets. We also give almost tight lower bounds for the size of k-wise independent sets.
منابع مشابه
Small-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem
In analogy with ε-biased sets over Z2 , we construct explicit ε-biased sets over nonabelian finite groups G. That is, we find sets S ⊂ G such that ‖Ex∈S ρ(x)‖ ≤ ε for any nontrivial irreducible representation ρ. Equivalently, such sets make G’s Cayley graph an expander with eigenvalue |λ| ≤ ε. The Alon-Roichman theorem shows that random sets of sizeO(log |G|/ε2) suffice. For groups of the form ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملDerandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random variables. We present an efficient derandomization of their bound using the method of pessimistic estimators (see Raghavan [JCSS 1988]). As a consequence, we derandomize an efficient construction ...
متن کاملDerandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random variables. We present an efficient derandomization of their bound using the method of pessimistic estimators (see Raghavan [Rag88]). As a consequence, we derandomize a construction of Alon and Roichman [AR94] (see als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 23 شماره
صفحات -
تاریخ انتشار 2016